A Class of MSR Codes for Clustered Distributed Storage

Clustered distributed storage models real data centers where intraand cross-cluster repair bandwidths are different. In this paper, exact-repair minimum-storage-regenerating (MSR) codes achieving capacity of clustered distributed storage are designed. Focus is given on two cases: = 0 and = 1/(n−k), where is the ratio of the available crossand intra-cluster repair bandwidths, n is the total number of distributed nodes and k is the number of contact nodes in data retrieval. The former represents the scenario where cross-cluster communication is not allowed, while the latter corresponds to the case of minimum cross-cluster bandwidth that is possible under the minimum storage overhead constraint. For the = 0 case, two types of locally repairable codes are proven to achieve the MSR point. As for = 1/(n − k), an explicit MSR coding scheme is suggested for the two-cluster situation under the specific of condition of n = 2k.